A formulation of combinatorial auction via reverse convex programming
نویسندگان
چکیده
منابع مشابه
A formulation of combinatorial auction via reverse convex programming
In combinatorial auctions, buyers and sellers bid not only for single items but also for combinations (or “bundles,” or “baskets”) of items. Clearing the auction is in general an NP-hard problem; it is usually solved with integer linear programming. We proposed in an earlier paper a continuous approximation of this problem, where orders are aggregated and integrality constraints are relaxed. It...
متن کاملSelecting Efficient Service-providers in Electric Power Distribution Industry Using Combinatorial Reverse Auction
In this paper, a combinatorial reverse auction mechanism is proposed for selecting the most efficient service-providers for resolving sustained power interruptions in multiple regions of an electric power distribution company’s responsibility area. Through this mechanism, supplying the required service in each region is assigned to only one potential service-provider considering two criteria in...
متن کاملGroup Buying based on Combinatorial Reverse Auction
Fu-Shiung Hsieh # Department of Computer Science and Information Engineering, Chaoyang University of Technology Taiwan, R.O.C. [email protected] Abstract—We formulate group buying problem as a combinatorial reverse auction problem with multiple buyers and multiple sellers. We propose the concept of proxy buyer to deal with this problem. The proxy buyer consolidates the demands from the buyers...
متن کاملA Comparative Study of Two Combinatorial Reverse Auction Models
Online group-buying is one of the most innovative business models employed by many companies. From the perspective of buyers, quantity based discounts provide a huge incentive to form coalitions and take advantage of lower prices without ordering more than their actual demand. Traditional group-buying mechanisms are usually based on a single item and uniform cost sharing. One way to reduce the ...
متن کاملInteger Programming for Combinatorial Auction Winner Determination
Combinatorial auctions are important as they enable bidders to place bids on combinations of items; compared to other auction mechanisms, they often increase the efficiency of the auction, while keeping risks for bidders low. However, the determination of an optimal winner combination in combinatorial auctions is a complex computational problem. In this paper we (i) compare recent algorithms fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Mathematics and Decision Sciences
سال: 2005
ISSN: 1173-9126,1532-7612
DOI: 10.1155/jamds.2005.19